2 00 6 Quantum Computation with Scattering Matrices

نویسندگان

  • G. GIORGADZE
  • R. TEVZADZE
چکیده

We discuss possible applications of the 1-D direct and inverse scattering problem to design of universal quantum gates for quantum computation. The potentials generating some universal gates are described.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A ug 2 00 7 Quantum graphs where back - scattering is prohibited

We describe a new class of scattering matrices for quantum graphs in which backscattering is prohibited. We discuss some properties of quantum graphs with these scattering matrices and explain the advantages and interest in their study. We also provide two methods to build the vertex scattering matrices needed for their construction.

متن کامل

Theoretical computation of the quantum transport of zigzag mono-layer Graphenes with various z-direction widths

The quantum transport computations have been carried on four different width of zigzag graphene using a nonequilibrium Green’s function method combined with density functional theory. The computed properties are included transmittance spectrum, electrical current and quantum conductance at the 0.3V as bias voltage.  The considered systems were composed from one-layer graphene sheets differing w...

متن کامل

Theoretical computation of the quantum transport of zigzag mono-layer Graphenes with various z-direction widths

The quantum transport computations have been carried on four different width of zigzag graphene using a nonequilibrium Green’s function method combined with density functional theory. The computed properties are included transmittance spectrum, electrical current and quantum conductance at the 0.3V as bias voltage.  The considered systems were composed from one-layer graphene sheets differing w...

متن کامل

ar X iv : q ua nt - p h / 03 09 06 0 v 1 6 S ep 2 00 3 Improving Gate - Level Simulation of Quantum Circuits ∗

Simulating quantum computation on a classical computer is a difficult problem. The matrices representing quantum gates, and vectors modeling qubit states grow exponentially with an increase in the number of qubits. However, by using a novel data structure called the Quantum Information Decision Diagram (QuIDD) that exploits the structure of quantum operators, many of these matrices and vectors ...

متن کامل

ar X iv : m at h - ph / 0 20 20 02 v 3 1 6 A pr 2 00 2 SU ( 4 ) Euler Angle Parameterization and Bipartite Density Matrices

In quantum mechanics, sets of density matrices are important for numerous reasons. For example, their compact notation make them useful for describing decoherence and entanglement properties of multi-particle quantum systems. In particular, two two-state density matrices, otherwise known as two qubit density matrices, are important for their role in explaining quantum teleportation, dense codin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006